/****************** Binary Search Tree *************************\
AUTHOR :Liwen Chu
-----------------------------------------------------------------
EMAIL :hiensjtu@gmail.com
-----------------------------------------------------------------
COMMENT: 
Feel free to use any part of this file, however, keeping
of the author infomation would be appreciated.
-----------------------------------------------------------------
DESCRIPTION: 
You are reading  a sequence of words from a very long stream. You
know a word a priori that omre than half the words are repetitions
of a single word W but the positions where W occurs are unknown. 
Design an efficient algorithm that reads this stream only once 
and uses only a constant amount of memory to identify W.
\***************************************************************/

#pragma once
class FindMajority
{
public:
	FindMajority(void);
	~FindMajority(void);

};

